Easily Computed Lower Bounds on the Information Rate of Intersymbol Interference Channels
نویسندگان
چکیده
منابع مشابه
Computing Lower Bounds on the Information Rate of Intersymbol Interference Channels
Provable lower bounds are presented for the information rate I(X ;X+S+N) where X is the symbol drawn from a fixed, finite-size alphabet, S a discrete-valued random variable (RV) and N a Gaussian RV. The information rate I(X ;X + S +N) serves as a tight lower bound for capacity of intersymbol interference (ISI) channels corrupted by Gaussian noise. The new bounds can be calculated with a reasona...
متن کاملEqualization of Sparse Intersymbol-Interference Channels Revisited
Sparse intersymbol-interference (ISI) channels are encountered in a variety of communication systems, especially in high-datarate systems. These channels have a large memory length, but only a small number of significant channel coefficients. In this paper, equalization of sparse ISI channels is revisited with focus on trellis-based techniques. Due to the large channel memory length, the comple...
متن کاملOn the low-rate Shannon limit for binary intersymbol interference channels
For a discrete-time, binary-input Gaussian channel with finite intersymbol interference (ISI), we prove that reliable communication can be achieved if and only if Eb=N0 > log 2=Gopt, for some constant Gopt that depends on the channel. To determine this constant, we consider the finite-state machine which represents the output sequences of the channel filter when driven by binary inputs. We then...
متن کاملGaussian Intersymbol Interference Channels With Mismatch
This paper considers the problem of channel coding over Gaussian intersymbol interference (ISI) channels with a given metric decoding rule. Specifically, it is assumed that the mismatched decoder has an incorrect assumption on the impulse response function. The mismatch capacity is the highest achievable rate for a given decoding rule. Existing lower bounds to the mismatch capacity for channels...
متن کاملSpatially-Coupled Codes and Threshold Saturation on Intersymbol-Interference Channels
Recently, it has been observed that terminated low-density-parity-check (LDPC) convolutional codes (or spatially-coupled codes) appear to approach capacity universally across the class of binary memoryless channels. This is facilitated by the “threshold saturation” effect whereby the belief-propagation (BP) threshold of the spatially-coupled ensemble is boosted to the maximum a-posteriori (MAP)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2012
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2173715